Low5 Boolean subalgebras and computable copies
نویسنده
چکیده
It is known that the spectrum of a Boolean algebra cannot contain a low4 degree unless it also contains the degree 0; it remains open whether the same holds for low5 degrees. We address the question differently, by considering Boolean subalgebras of the computable atomless Boolean algebra B. For such subalgebras A, we show that it is possible for the spectrum of the unary relation A on B to contain a low5 degree without containing 0.
منابع مشابه
Low n Boolean Subalgebras
Every lown Boolean algebra, for 1 ≤ n ≤ 4, is isomorphic to a computable Boolean algebra. It is not yet known whether the same is true for n > 4. However, it is known that there exists a low5 subalgebra of the computable atomless Boolean algebra which, when viewed as a relation on the computable atomless Boolean algebra, does not have a computable copy. We adapt the proof of this recent result ...
متن کاملBoolean Algebra Approximations
Knight and Stob proved that every low4 Boolean algebra is 0-isomorphic to a computable one. Furthermore, for n = 1, 2, 3, 4, every lown Boolean algebra is 0-isomorphic to a computable one. We show that this is not true for n = 5: there is a low5 Boolean algebra that is not 0-isomorphic to any computable Boolean algebra. It is worth remarking that, because of the machinery developed, the proof u...
متن کاملCharacterizing the Computable Structures: Boolean Algebras and Linear Orders
A countable structure (with finite signature) is computable if its universe can be identified with ω in such a way as to make the relations and operations computable functions. In this thesis, I study which Boolean algebras and linear orders are computable. Making use of Ketonen invariants, I study the Boolean algebras of low Ketonen depth, both classically and effectively. Classically, I give ...
متن کاملDegree Spectra of Relations on Boolean Algebras
We show that every computable relation on a computable Boolean algebra B is either definable by a quantifier-free formula with constants from B (in which case it is obviously intrinsically computable) or has infinite degree spectrum. Computable mathematics has been the focus of a large amount of research in the past few decades. Computable model theory in particular has seen vigorous and varied...
متن کاملBoolean Subalgebras of Orthoalgebras
We reconstruct orthoalgebras from their partially ordered set of Boolean subalgebras, and characterize partially ordered sets of this form, using a new notion of a direction. For Boolean algebras, this reconstruction is functorial, and nearly an equivalence.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 76 شماره
صفحات -
تاریخ انتشار 2011